Constructing a Simple Polygonalizations

نویسندگان

  • V. Tereshchenko
  • V. Muravitskiy
چکیده

We consider the methods of construction simple polygons for a set S of n points and applying them for searching the minimal area polygon. In this paper we propose the approximate algorithm, which generates the simple polygonalizations of a fixed set of points and finds the minimal area polygon, in O (n) time and using O(n) memory. Keywords—simple polygon, approximate algorithm, minimal area polygon, polygonalizations

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Simple Polygonalizations with Optimal Area

We discuss the problem of finding a simple polygonalization for a given set of vertices P that has optimal area. We show that these problems are very closely related to problems of optimizing the number of points from a set Q in a simple polygon with vertex set P and prove that it is NP-complete to find a minimum weight polygon or a maximum weight polygon for a given vertex set, resulting in a ...

متن کامل

Constructing a Confidence Interval for Quantiles of Normal Distribution‎, ‎one and Two Population

‎In this paper‎, ‎in order to establish a confidence interval (general and shortest) for quantiles of normal distribution in the case of one population‎, ‎we present a pivotal quantity that has non-central t distribution‎. ‎In the case of two independent normal populations‎, ‎we construct a confidence interval for the difference quantiles based on the generalized pivotal quantity and introduce ...

متن کامل

Exact evaluation of limits and tangents for non-polynomial subdivision schemes

In this paper, we describe a method for exact evaluation of a limit mesh defined via subdivision and its associated tangent vectors on a uniform grid of any size. Other exact evaluation technique either restrict the grids to have subdivision sampling and are, hence, exponentially increasing in size or make assumptions about the underlying surface being piecewise polynomial (Stam’s method is a w...

متن کامل

Frequency–driven chaos in the electrical circuit of Duffing-Holmes oscillator and its control

Accurate detection of weak periodic signals within noise and possibility of secure messaging have made Duffing oscillator (DO) highly important in the field of communication. Investigation on the properties of DO is thus ardently sought for. An elegant approach to accomplish the same is to fabricate electronic circuit simulating DO non-linear equation and to study the effect of input signal amp...

متن کامل

Combinatorial and computational problems about points in the plane

We study three problems in combinatorial geometry. The problems investigated are con ict-free colorings of point sets in the plane with few colors, polychromatic colorings of the vertices of rectangular partitions in the plane and in higher dimensions and polygonalizations of point sets with few re ex points. These problems are problems of discrete point sets, the proofs are of combinatorial av...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012